منابع مشابه
Sparse molecular image representation
Sparsity-based models have proven to be very effective in most image processing applications. The notion of sparsity has recently been extended to structured sparsity models where not only the number of components but also their support is important. This paper goes one step further and proposes a new model where signals are composed of a small number of molecules, which are each linear combina...
متن کاملImage Classification via Sparse Representation and Subspace Alignment
Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...
متن کاملSparse Image Representation by Directionlets
In spite of the success of the standard wavelet transform (WT) in image processing in recent years, the efficiency and sparsity of its representation is limited by the spatial symmetry and separability of its basis functions built in the horizontal and vertical directions. One-dimensional (1-D) discontinuities in images (edges or contours) that are very important elements in visual perception, ...
متن کاملRegional multifocus image fusion using sparse representation.
Due to the nature of involved optics, the depth of field in imaging systems is usually constricted in the field of view. As a result, we get the image with only parts of the scene in focus. To extend the depth of field, fusing the images at different focus levels is a promising approach. This paper proposes a novel multifocus image fusion approach based on clarity enhanced image segmentation an...
متن کاملSparse Signal Representation: Image Compression using Sparse Bayesian Learning
with Φ ∈ RN×M , M ≥ N , and some noise . The challenge is to determine the sparsest representation of reconstruction coefficients w = [w1, . . . , wM ] . Finding a sparse representation of a signal in an overcomplete dictionary is equivalent to solving a regularized linear inverse. For a given dictionary Φ, finding the maximally sparse w is an NP-hard problem [1]. A great deal of recent researc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Visual Communication and Image Representation
سال: 2016
ISSN: 1047-3203
DOI: 10.1016/j.jvcir.2016.01.013